EXPONENTIAL DISPERSION MODELS AND THE GAUSS-NEWTON ALGORITHM
نویسندگان
چکیده
منابع مشابه
Exponential Dispersion Models and the Gauss-Newton Algorithm
It is well known that the Fisher scoring iteration for generalized linear models has the same form as the Gauss-Newton algorithm for normal regression. This note shows that exponential dispersion models are the most general families to preserve this form for the scoring iteration. Therefore exponential dispersion models are the most general extension of generalized linear models for which the a...
متن کاملA two-dimensional search for a Gauss-Newton algorithm
This paper describes a fall-back procedure for use with the Gauss-Newton method for nonlinear least-squares problems. While the basic Gauss-Newton algorithm is often successful, it is well-known that it can sometimes generate poor search directions and exhibit slow convergence. For dealing with such situations we suggest a new two-dimensional search strategy. Numerical experiments indicate that...
متن کاملBlind Separation of Convolutive Mixtures: A Gauss-Newton Algorithm
This paper addresses the blind separation of convolutive mixtures of independent and non-Gaussian sources. We present a block-based Gauss-Newton algorithm which is able to obtain a separation solution using only a specific set of output cross-cumulants and the hypothesis of soft mixtures. The order of the cross-cumulants is chosen to obtain a particular form of the Jacobian matrix that ensures ...
متن کاملPhaseless Recovery Using the Gauss-Newton Method
Abstract. In this paper, we develop a concrete algorithm for phase retrieval, which we refer to as GaussNewton algorithm. In short, this algorithm starts with a good initial estimation, which is obtained by a modified spectral method, and then update the iteration point by a Gauss-Newton iteration step. We prove that a re-sampled version of this algorithm quadratically converges to the solution...
متن کاملThe Newton Polygon of Gauss-Heilbronn Sums
Let p be a prime, Zp the ring of p-adic integers, Qp the field of p-adic numbers, and Qp the algebraic closure of Qp. Let Fp be the algebraic closure of the finite field Fp, and ω : Fp → Qp the Techmüller lifting. Let q = pa, χ a multiplicative character of Fq into Q, and ψ a character of Zp[μq−1] into Q of exact order pn > 1, where μr is the set of r-th roots of unity in Qp. For simplicity, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Australian Journal of Statistics
سال: 1991
ISSN: 0004-9581
DOI: 10.1111/j.1467-842x.1991.tb00412.x